iLike integrating visual and textual features for vertical search.

Mr.KNN soft relevance for multi%2Dlabel classification.

A Markov blanket%2Dbased method for detecting causal SNPs in GWAS.

Combating the Small Sample Class Imbalance Problem Using Feature Selection.

Cross%2Dplatform microarray data integration using the Normalised Linear Transform.

Cross%2Dplatform microarray data integration using the Normalised Linear Transform.

DASSO%2DMB Detection of Epistatic Interactions in Genome%2DWide Association Studies Using Markov Blankets.

Learning to rank with a novel kernel perceptron method.

Assessing reliability of protein%2Dprotein interactions by integrative analysis of data in model organisms.

Knowledge%2Dguided inference of domain%2Ddomain interactions from incomplete protein%2Dprotein interaction networks.

Knowledge%2Dguided inference of domain%2Ddomain interactions from incomplete protein%2Dprotein interaction networks.

Identification of genes involved in the same pathways using a Hidden Markov Model%2Dbased approach.

Sequence%2Dbased prediction of protein interaction sites with an integrative method.

Editorial.
calls &amp; calendarEDITORIAL
2008 IEEE International Conference on Bioinformatics and Biomedicine

Seventh International Conference on Machine Learning and Applications
The quality of large-scale recommendation systems has been insufficient in terms of the accuracy of prediction. One of the major reasons is caused by the sparsity of the samples, usually represented by vectors of users ’ ratings on a set of items. Combining information other than users ’ ratings can provide the learning model complementary views of the data and, thus, a more accurate prediction. In this paper, we propose efficient methods for finding the best combination weights among single kernels. The weight parameters are optimized by aligning the combination kernel to ideal kernels. We solve the kernel alignment problem by linear programming techniques.
The Sixth International Conference on Machine Learning and Applications

The Sixth International Conference on Machine Learning and Applications

Integrative Neural Network Approach for Protein Interaction Prediction from Heterogeneous Data.

Protein%2DProtein Interaction Prediction and Assessment from Model Organisms.


Gene Network Learning Using Regulated Dynamic Bayesian Network Methods.


Improving Bayesian Network Structure Learning with Mutual Information%2DBased Node Ordering in the K2 Algorithm.

Large%2Dscale Protein%2DProtein Interaction prediction using novel kernel methods.

A Bayesian approach to support vector machines for the binary classification.

Human Disease%2DGene Classification with Integrative Sequence%2DBased and Topological Features of Protein%2DProtein Interaction Networks.

Minimum reference set based feature selection for small sample classifications.

Enhanced recursive feature elimination.

Normalized Linear Transform for Cross%2DPlatform Microarray Data Integration.

Data%2DDependent Kernel Machines for Microarray Data Classification.

Structural Risk Minimisation based gene expression profiling analysis.

Comparison of One%2DClass SVM and Two%2DClass SVM for Fold Recognition.

Kernel%2Dbased distance metric learning for microarray data classification.

An effective structure learning method for constructing gene networks.
Motivation: Bayesian network methods have shown promise in gene regulatory network reconstruction because of their capability of capturing causal relationships between genes and handling data with noises found in biological experiments. The problem of learning network structures, however, is NP hard. Consequently, heuristic methods such as hill climbing are used for structure learning. For networks of a moderate size, hill climbing methods are not computationally efficient. Furthermore, relatively low accuracy of the learned structures may be observed. The purpose of this paper is to present a novel structure learning method for gene network discovery.. Results: In this paper, we present a novel structure learning method to reconstruct the underlying gene networks from the observational gene expression data. Unlike hill climbing approaches, the proposed method first constructs an undirected network based on mutual information between two nodes and then split the structure into substructures. The directional orientations for the edges that connect two nodes are then obtained by optimizing a scoring function for each substructure. Our method is evaluated using two benchmark network datasets with known structures. The results show that the proposed method can identify networks that are close to the optimal structures. It outperforms hill climbing methods in terms of both computation time and predicted structure accuracy. We also apply the method to gene expression data measured during the yeast cycle and show the effectiveness of the proposed method for network reconstruction. 
Margin%2Dbased wrapper methods for gene identification using microarray.

Multi%2Dclass feature selection for texture classification.

Optimized Kernel Machine for Cancer Classification Using Gene Expression Data.

Bayesian neural network approaches to ovarian cancer identification from high%2Dresolution mass spectrometry data.

Prediction of protein%2Dprotein interactions using random decision forest framework.

Prediction of protein%2Dprotein interactions using random decision forest framework.

Locally optimal search method for identifying genes from microarray data.

Gene Selection for Cancer Classification Using Bootstrapped Genetic Algorithms and Support Vector Machines.
The gene expression data obtained from microarrays have shown useful in cancer classification. DNA microarray data have extremely high dimensionality compared to the small number of available samples. In this paper, we propose a novel system for selecting a set of genes for cancer classification. This system is based on a linear support vector machine and a genetic algorithm. To overcome the problem of the small size of training samples, bootstrap methods are combined into genetic search. Two databases are considered: the colon cancer database and the leukemia database. Our experimental results show that the proposed method is capable of finding genes that discriminate between normal cells and cancer cells and generalizes well. 1.
Radial basis function neural networks for nonlinear Fisher discrimination and Neyman%2DPearson classification.



An improved branch and bound algorithm for feature selection.
Feature selection plays an important role in pattern classification. In this paper, we present an improved Branch and Bound algorithm for optimal feature subset selection. This algorithm searches for an optimal solution in a large solution tree in an efficient manner by cutting unnecessary paths which are guaranteed not to contain the optimal solution. Our experimental results demonstrate the effectiveness of the new algorithm.
Facial expression recognition A clustering%2Dbased approach.
This paper describes a new clustering based feature extraction method for facial expression recognition. We demonstrate the effectiveness of this method and compare it with commonly used principal component analysis method and linear discriminant analysis method.
